Eccentricity energy change of complete multipartite graphs due to edge deletion

نویسندگان

چکیده

Abstract The eccentricity matrix ? ( G ) of a graph is obtained from the distance by retaining largest distances in each row and column, leaving zeros remaining ones. energy sum absolute values eigenvalues ). Although matrices graphs are closely related to graphs, number properties substantially different those matrices. change due an edge deletion one such property. In this article, we give examples for which increase (resp., decrease) but decrease increase) deletion. Also, prove that complete k -partite K n 1, ... , nk with ? 2 i 2, increases

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Energy Change Due to Edge Deletion

The energy of a graph is the sum of the singular values of its adjacency matrix. We are interested in how the energy of a graph changes when edges are deleted. Examples show that all cases are possible: increased, decreased, unchanged. Our goal is to find possible graph theoretical descriptions and to provide an infinite family of graphs for each case. The main tool is a singular value inequali...

متن کامل

Ela Graph Energy Change Due to Any Single Edge Deletion

Abstract. The energy of a graph is the sum of the absolute values of its eigenvalues. We propose a new problem on graph energy change due to any single edge deletion. Then we survey the literature for existing partial solution of the problem, and mention a conjecture based on numerical evidence. Moreover, we prove in three different ways that the energy of a cycle graph decreases when an arbitr...

متن کامل

Average Degree-Eccentricity Energy of Graphs

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

متن کامل

Integral complete multipartite graphs

A graph is called integral if all eigenvalues of its adjacency matrix are integers. In this paper, we investigate integral complete r-partite graphsKp1,p2,...,pr =Ka1·p1,a2·p2,...,as ·ps with s=3, 4.We can construct infinite many new classes of such integral graphs by solving some certain Diophantine equations. These results are different from those in the existing literature. For s = 4, we giv...

متن کامل

On spectral radius and energy of complete multipartite graphs

LetKn1,n2,...,np denote the complete p-partite graph, p > 1, on n = n1+n2+ · · ·+np vertices and let n1 ≥ n2 ≥ · · · ≥ np > 0. We show that for a fixed value of n, both the spectral radius and the energy of complete p-partite graphs are minimal for complete split graph CS(n, p− 1) and are maximal for Turán graph T (n, p).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Special Matrices

سال: 2022

ISSN: ['2300-7451']

DOI: https://doi.org/10.1515/spma-2021-0156